Distinct Parts Partitions without Sequences

نویسندگان

  • Kathrin Bringmann
  • Karl Mahlburg
  • Karthik Nataraj
چکیده

Partitions without sequences of consecutive integers as parts have been studied recently by many authors, including Andrews, Holroyd, Liggett, and Romik, among others. Their results include a description of combinatorial properties, hypergeometric representations for the generating functions, and asymptotic formulas for the enumeration functions. We complete a similar investigation of partitions into distinct parts without sequences, which are of particular interest due to their relationship with the Rogers-Ramanujan identities. Our main results include a double series representation for the generating function, an asymptotic formula for the enumeration function, and several combinatorial inequalities.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Maximum Product Over Partitions Into Distinct Parts

We establish an explicit formula for the maximum value of the product of parts for partitions of a positive integer into distinct parts (sequence A034893 in the On-Line Encyclopedia of Integer Sequences).

متن کامل

Fibonacci Partitions

Then f(z) is also an analytic function without zeros on compact subsets of the unit disk. We have A * ) = n o * * ) 1 = z v < °=0(4) «>1 «>0 Definition 1: Let r(#)? r^(n), r0(w) denote, respectively, the number of partitions of n into distinct parts, evenly many distinct parts, oddly many distinct parts from {un}. Let r (0) = rE(0) = l, r0(0) = 0. If an =rE(n)-rQ(n)9 then U„ is the number of pa...

متن کامل

A note on partitions into distinct parts and odd parts

Bousquet-Mélou and Eriksson showed that the number of partitions of n into distinct parts whose alternating sum is k is equal to the number of partitions of n into k odd parts, which is a refinement of a well-known result by Euler. We give a different graphical interpretation of the bijection by Sylvester on partitions into distinct parts and partitions into odd parts, and show that the bijecti...

متن کامل

Core partitions into distinct parts and an analog of Euler's theorem

A special case of an elegant result due to Anderson proves that the number of (s, s + 1)-core partitions is finite and is given by the Catalan number Cs. Amdeberhan recently conjectured that the number of (s, s + 1)-core partitions into distinct parts equals the Fibonacci number Fs+1. We prove this conjecture by enumerating, more generally, (s, ds− 1)-core partitions into distinct parts. We do ...

متن کامل

New Congruences for Partitions where the Odd Parts are Distinct

Let pod(n) denote the number of partitions of n wherein odd parts are distinct (and even parts are unrestricted). We find some new interesting congruences for pod(n) modulo 3, 5 and 9.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Electr. J. Comb.

دوره 22  شماره 

صفحات  -

تاریخ انتشار 2015